Verifiable Encrypted Redundancy for Mix-Type Remote Electronic Voting
نویسندگان
چکیده
In this paper we present a mix-type remote electronic voting system belonging to the “proof of product with redundancy” paradigm. Votes are composed using a redundancy system that permits to prove the correct composition and plaintext awareness of votes at vote reception and check the validity of the mixing operation while preventing some privacy or denial of service attacks that were possible in previous proposals in the literature.
منابع مشابه
Lecture 18 : Mix net Voting Systems
In the previous lecture, we defined the notion of an electronic voting system, and specified the requirements from such a system. In particular, we required an electronic voting system to be verifiable and robust. Loosely speaking, a voting system is said to be verifiable if any individual can verify that his vote was counted. A voting system is said to be robust if there does not exist any sma...
متن کاملSimple and efficient hash-based verifiable mixing for remote electronic voting
Please cite this article in press as: F. Sebé et al., doi:10.1016/j.comcom.2009.11.013 Remote voting permits an election to be carried out through telecommunication networks. In this way, its participants are not required to physically move to the polling place. Votes are automatically collected and counted so that once the election ends, the results can be published after a very short delay. S...
متن کاملA Lightweight Implementation of a Shuffle Proof for Electronic Voting Systems
In the usual setting of a verifiable mix-net, an input batch of ciphertexts is shuffled through a series of mixers into an output batch of ciphertexts while hiding the mapping between input and output and preserving the plaintexts. Unlike shuffling, proving the correctness of a shuffle is relatively expensive and difficult to implement. In this paper, we present a new implementation of a shuffl...
متن کاملApplications of Polynomial Properties to Verifiable Delegation of Computation and Electronic Voting
This paper presents some proposals of protocols for two types of schemes such as verifiable delegation of computation and remote electronic voting, based on polynomial properties. Our protocols for verifiable delegation of computation are aimed to the efficient evaluation of polynomials, working on schemes where the polynomial and/or the input are kept secret to the server. Our proposal for rem...
متن کاملUsability Analysis of Helios - An Open Source Verifiable Remote Electronic Voting System
Currently, rather secure cryptographic voting protocols providing verifiability exist. However, without adequate usability and abstraction concepts to explain the voting process and, in particular, the verifiability steps, they are not ready for legally binding elections. This holds in particular for remote electronic voting systems because of the absence of poll workers who can support voters ...
متن کامل